Numerical Computation of an Analytic

نویسندگان

  • Volker Mehrmann
  • Nancy K. Nichols
چکیده

This paper extends the singular value decomposition to a path of matrices E(t). An analytic singular value decomposition of a path of matrices E(t) is an analytic path of factorizations E(t) = X(t)S(t)Y (t)T where X(t) and Y (t) are orthogonal and S(t) is diagonal. To maintain di erentiability the diagonal entries of S(t) are allowed to be either positive or negative and to appear in any order. This paper investigates existence and uniqueness of analytic SVD's and develops an algorithm for computing them. We show that a real analytic path E(t) always admits a real analytic SVD, a full-rank, smooth path E(t) with distinct singular values admits a smooth SVD. We derive a di erential equation for the left factor, develop Euler-like and extrapolated Euler-like numerical methods for approximating an analytic SVD and prove that the Euler-like method converges.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Methods for the Computation of Analytic Singular Value Decompositions

Abstract. An analytic singular value decomposition (ASVD) of a path of matrices E(t) is an analytic path of factorizations E(t) = X(t)S(t)Y (t) where X(t) and Y (t) are orthogonal and S(t) is diagonal. The diagonal entries of S(t) are allowed to be either positive or negative and to appear in any order. For an analytic path matrix E(t) an ASVD exists, but this ASVD is not unique. We present two...

متن کامل

Generalized quadrature formulae for analytic functions

A kind of generalized quadrature formulae of maximal degree of precision for numerical integration of analytic functions is considered. Precisely, a general weighted quadrature of Birkhoff-Young type with 4n+3 nodes and degree of precision 6n+5 is studied. Its nodes are characterized by an orthogonality relation and a general numerical method for their computation is given. Special cases and nu...

متن کامل

Mathematical Modeling of Gas Adsorption Processes in Packed Bed: The Role of Numerical Methods on Computation Time

Rigorous mathematical modeling of adsorption processes in packed beds involves time-consuming computations which are considered as the fundamental weakness of such thorough mathematical models. Thus, reducing the computation time was a key factor in improving adsorption mathematical models. In order to achieve this goal, an attempt was made to know how much using different numerical methods inf...

متن کامل

Numerical Computation of an Analytic Singular Value Decomposition of a Matrix Valued Function Partial Support Received from Sfb 343, Diskrete Strukturen in Der Mathematik, Universitt at Bielefeld

This paper extends the singular value decomposition to a path of matrices E(t). An analytic singular value decomposition of a path of matrices E(t) is an analytic path of factorizations E(t) = X(t)S(t)Y (t)T where X(t) and Y (t) are orthogonal and S(t) is diagonal. To maintain di erentiability the diagonal entries of S(t) are allowed to be either positive or negative and to appear in any order....

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991